5 Prime values of reducible polynomials , II
نویسنده
چکیده
1 Supported by National Natural Science Foundation of China, Grant No. 0171046 and the “ 333 Project” Foundation of Jiangsu Province of China. The work was done while first author was visiting the Mathematical Institute of the Hungarian Academy of Sciences. 2 Supported by Hungarian National Foundation for Scientific Research, Grants No. F 026049 and T 30074 3 Supported by Hungarian National Foundation for Scientific Research, Grants No. T 025617 and T 29759
منابع مشابه
Square-free Values of Reducible Polynomials
We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct primes.
متن کاملSurvey on Counting Special Types of Polynomials
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gauß count the remaining ones, approximately and exactly. For polynomials in two or more variables, the situation changes dramatically. Most multivariate polynomials are irreducible. This survey presents counting results for some special classes of mu...
متن کاملFactorization of Quadratic Polynomials in the Ring of Formal Power Series Over
We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring Z[[x]] of formal power series with integer coefficients. For n,m ≥ 1 and p prime, we show that p+pβx+αx is reducible in Z[[x]] if and only if it is reducible in Zp[x], the ring of polynomials over the p-adic integers.
متن کاملA New Algorithm to Search for Irreducible Polynomials Using Decimal Equivalents of Polynomials over Galois Field GF(p)
In this paper a new algorithm to find the decimal equivalents of all monic irreducible polynomials (IPs) over Galois Field GF(p) has been introduced. This algorithm is effective to find the decimal equivalents of monic IPs over Galois Field with a large value of prime modulus and also with a large extension of the prime modulus. The algorithm introduced in this paper is much more time effective...
متن کاملPrime numbers and quadratic polynomials
Some nonconstant polynomials with a finite string of prime values are known; in this paper, some polynomials of this kind are described, starting from Euler’s example (1772) P(x) = x2+x+41: other quadratic polynomials with prime values were studied, and their properties were related to properties of quadratic fields; in this paper, some quadratic polynomials with prime values are described and ...
متن کامل